package 数据结构.排序编程作业;

import java.util.Scanner;

/**
 * @author IT_Jay
 * @date 2021/12/8 3:03 PM
 */
public class Test02 {
    public static void main(String[] args) {
        String[] s = new Scanner(System.in).nextLine().split(" ");
        int length = s.length;
        int[] arr = new int[length];
        for (int i = 0; i < length; i++) {
            arr[i] =Integer.parseInt(s[i]);
        }
        for (int i = 0; i < length; i++) {
            int min = i;
            for (int j = i; j < length; j++) {
                if (arr[min] > arr[j])
                    min=j;
            }
            if (i != min){
                int temp= arr[i];
                arr[i] = arr[min];
                arr[min] = temp;
            }
        }
        for (int item : arr){
            System.out.print(item+ " ");
        }
    }
}
